Forecasts covering one month using a cut-cell model

Forecasts covering one month using a cut - cell model

A multiobjective continuous covering location model

This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...

Cut Coloring and Circuit Covering

We prove that for every 3-edge-connected graph G there exists a partition of E(G) into at most nine sets {X1, X2, . . . , Xm} so that G \ Xi is 2-edge-connected for every 1 ≤ i ≤ m. We then generalize this result, proving that for every (2k+1)-edgeconnected graph G there is a partition of E(G) into a bounded number (depending only on k) of sets {X1, X2, . . . , Xm} so that G \ Xi is 2k-edge-con...

Accelerating Benders method using covering cut bundle generation

Over the years, various techniques have been proposed to speed up the classical Benders decomposition algorithm. The work presented in the literature has focused mainly on either reducing the number of iterations of the algorithm or on restricting the solution space of the decomposed problems. In this article, a new strategy for Benders algorithm is proposed and applied to two case studies in o...

The Parsimonious Property of Cut Covering Problems

We consider the analysis of linear programming relaxations of a large class of combinatorial problems that can be formulated as problems of covering cuts, including the Steiner tree, the traveling salesman, the vehicle routing, the matching, the T-join and the survivable network design problem, to name a few. We prove that all of the problems in the class satisfy a deep structural property, the...